{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:MVCDKGIP4FNPDHPWW6ASMDRZUV","short_pith_number":"pith:MVCDKGIP","canonical_record":{"source":{"id":"1312.5180","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-12-18T15:36:40Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"77b1ca6eb1b318263b8d902c2ae64a2484b7e3bc803c4aedce9bc70b4f6c149f","abstract_canon_sha256":"48c27aea97c8abf7e921b40232308fff958204a00131052aafc410c9aac23313"},"schema_version":"1.0"},"canonical_sha256":"654435190fe15af19df6b781260e39a56c8c14cfcd33f3448a472eef1cd59724","source":{"kind":"arxiv","id":"1312.5180","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.5180","created_at":"2026-05-18T03:04:16Z"},{"alias_kind":"arxiv_version","alias_value":"1312.5180v1","created_at":"2026-05-18T03:04:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.5180","created_at":"2026-05-18T03:04:16Z"},{"alias_kind":"pith_short_12","alias_value":"MVCDKGIP4FNP","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"MVCDKGIP4FNPDHPW","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"MVCDKGIP","created_at":"2026-05-18T12:27:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:MVCDKGIP4FNPDHPWW6ASMDRZUV","target":"record","payload":{"canonical_record":{"source":{"id":"1312.5180","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-12-18T15:36:40Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"77b1ca6eb1b318263b8d902c2ae64a2484b7e3bc803c4aedce9bc70b4f6c149f","abstract_canon_sha256":"48c27aea97c8abf7e921b40232308fff958204a00131052aafc410c9aac23313"},"schema_version":"1.0"},"canonical_sha256":"654435190fe15af19df6b781260e39a56c8c14cfcd33f3448a472eef1cd59724","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:04:16.020463Z","signature_b64":"P5Hvi8nVeRVUw9Jvn2QDclXW1JcGTGfsCGhRVvndRGSqGs//El3WUTAN4XiTvzRloVgfg/Y2fxFzkh07Q4/dDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"654435190fe15af19df6b781260e39a56c8c14cfcd33f3448a472eef1cd59724","last_reissued_at":"2026-05-18T03:04:16.019801Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:04:16.019801Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1312.5180","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:04:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2vk2ubMoCq94ETJQKGKig72fV2Po0iXh0mNisOrXGqtvI1Tu+68s0wR2W2MLHmpIerg/sYSTqH9GSCLXTgUmDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T17:33:20.780472Z"},"content_sha256":"16e5aab99878b063763a50a0e9439fec05b88dd86978a769f01c799505dacf10","schema_version":"1.0","event_id":"sha256:16e5aab99878b063763a50a0e9439fec05b88dd86978a769f01c799505dacf10"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:MVCDKGIP4FNPDHPWW6ASMDRZUV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Maximal induced matchings in triangle-free graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"math.CO","authors_text":"Manu Basavaraju, Pim van 't Hof, Pinar Heggernes, Reza Saei, Yngve Villanger","submitted_at":"2013-12-18T15:36:40Z","abstract_excerpt":"An induced matching in a graph is a set of edges whose endpoints induce a $1$-regular subgraph. It is known that any $n$-vertex graph has at most $10^{n/5} \\approx 1.5849^n$ maximal induced matchings, and this bound is best possible. We prove that any $n$-vertex triangle-free graph has at most $3^{n/3} \\approx 1.4423^n$ maximal induced matchings, and this bound is attained by any disjoint union of copies of the complete bipartite graph $K_{3,3}$. Our result implies that all maximal induced matchings in an $n$-vertex triangle-free graph can be listed in time $O(1.4423^n)$, yielding the fastest "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.5180","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:04:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SzNawi+lPxrl2NDlohZC+UtOEnJ+YKJ4jpaROqzMtCUHC5oKYrp92/4lZK30ch/k/cwUxr1vFSsFdLZCY+qaBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T17:33:20.781188Z"},"content_sha256":"ff5569d9580b2ff0cbab555cc38e37a07396b8ac17013acded11ffad6007bf93","schema_version":"1.0","event_id":"sha256:ff5569d9580b2ff0cbab555cc38e37a07396b8ac17013acded11ffad6007bf93"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MVCDKGIP4FNPDHPWW6ASMDRZUV/bundle.json","state_url":"https://pith.science/pith/MVCDKGIP4FNPDHPWW6ASMDRZUV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MVCDKGIP4FNPDHPWW6ASMDRZUV/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-28T17:33:20Z","links":{"resolver":"https://pith.science/pith/MVCDKGIP4FNPDHPWW6ASMDRZUV","bundle":"https://pith.science/pith/MVCDKGIP4FNPDHPWW6ASMDRZUV/bundle.json","state":"https://pith.science/pith/MVCDKGIP4FNPDHPWW6ASMDRZUV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MVCDKGIP4FNPDHPWW6ASMDRZUV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:MVCDKGIP4FNPDHPWW6ASMDRZUV","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"48c27aea97c8abf7e921b40232308fff958204a00131052aafc410c9aac23313","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-12-18T15:36:40Z","title_canon_sha256":"77b1ca6eb1b318263b8d902c2ae64a2484b7e3bc803c4aedce9bc70b4f6c149f"},"schema_version":"1.0","source":{"id":"1312.5180","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.5180","created_at":"2026-05-18T03:04:16Z"},{"alias_kind":"arxiv_version","alias_value":"1312.5180v1","created_at":"2026-05-18T03:04:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.5180","created_at":"2026-05-18T03:04:16Z"},{"alias_kind":"pith_short_12","alias_value":"MVCDKGIP4FNP","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"MVCDKGIP4FNPDHPW","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"MVCDKGIP","created_at":"2026-05-18T12:27:52Z"}],"graph_snapshots":[{"event_id":"sha256:ff5569d9580b2ff0cbab555cc38e37a07396b8ac17013acded11ffad6007bf93","target":"graph","created_at":"2026-05-18T03:04:16Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"An induced matching in a graph is a set of edges whose endpoints induce a $1$-regular subgraph. It is known that any $n$-vertex graph has at most $10^{n/5} \\approx 1.5849^n$ maximal induced matchings, and this bound is best possible. We prove that any $n$-vertex triangle-free graph has at most $3^{n/3} \\approx 1.4423^n$ maximal induced matchings, and this bound is attained by any disjoint union of copies of the complete bipartite graph $K_{3,3}$. Our result implies that all maximal induced matchings in an $n$-vertex triangle-free graph can be listed in time $O(1.4423^n)$, yielding the fastest ","authors_text":"Manu Basavaraju, Pim van 't Hof, Pinar Heggernes, Reza Saei, Yngve Villanger","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-12-18T15:36:40Z","title":"Maximal induced matchings in triangle-free graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.5180","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:16e5aab99878b063763a50a0e9439fec05b88dd86978a769f01c799505dacf10","target":"record","created_at":"2026-05-18T03:04:16Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"48c27aea97c8abf7e921b40232308fff958204a00131052aafc410c9aac23313","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-12-18T15:36:40Z","title_canon_sha256":"77b1ca6eb1b318263b8d902c2ae64a2484b7e3bc803c4aedce9bc70b4f6c149f"},"schema_version":"1.0","source":{"id":"1312.5180","kind":"arxiv","version":1}},"canonical_sha256":"654435190fe15af19df6b781260e39a56c8c14cfcd33f3448a472eef1cd59724","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"654435190fe15af19df6b781260e39a56c8c14cfcd33f3448a472eef1cd59724","first_computed_at":"2026-05-18T03:04:16.019801Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:04:16.019801Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"P5Hvi8nVeRVUw9Jvn2QDclXW1JcGTGfsCGhRVvndRGSqGs//El3WUTAN4XiTvzRloVgfg/Y2fxFzkh07Q4/dDg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:04:16.020463Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.5180","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:16e5aab99878b063763a50a0e9439fec05b88dd86978a769f01c799505dacf10","sha256:ff5569d9580b2ff0cbab555cc38e37a07396b8ac17013acded11ffad6007bf93"],"state_sha256":"e844865e248397f38a6d8dcd4a64ea8d5dc908ce59f0311fe22a4198a26e17ad"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yz6c8Q1HMgh7FPS8cmNfQoYom2pErE59y4gr/LGTJdYjYykXaNnmLBZPb4c99cTdvv0Dva30DTlKr9CnaBgbBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T17:33:20.785082Z","bundle_sha256":"eb8d3470a56ad328bdf3a320b0fe704caf30176a82eaba5f26383bcfc5ee7002"}}