{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:BRM74ZIV6Z2I4FQWQ5IGQNKT5P","short_pith_number":"pith:BRM74ZIV","canonical_record":{"source":{"id":"1802.06298","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-02-17T21:30:06Z","cross_cats_sorted":[],"title_canon_sha256":"95da9917ed53995436fe4ba7bae332242ef0baeaf871ec5252eae07fe97b85af","abstract_canon_sha256":"789decfb8a5755264b209ffe4069a45d887dfbcb6ca06b38fd5c29bc65dba158"},"schema_version":"1.0"},"canonical_sha256":"0c59fe6515f6748e16168750683553ebf0438582d3abf6612e221da168e95faf","source":{"kind":"arxiv","id":"1802.06298","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.06298","created_at":"2026-05-18T00:23:03Z"},{"alias_kind":"arxiv_version","alias_value":"1802.06298v1","created_at":"2026-05-18T00:23:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.06298","created_at":"2026-05-18T00:23:03Z"},{"alias_kind":"pith_short_12","alias_value":"BRM74ZIV6Z2I","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"BRM74ZIV6Z2I4FQW","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"BRM74ZIV","created_at":"2026-05-18T12:32:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:BRM74ZIV6Z2I4FQWQ5IGQNKT5P","target":"record","payload":{"canonical_record":{"source":{"id":"1802.06298","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-02-17T21:30:06Z","cross_cats_sorted":[],"title_canon_sha256":"95da9917ed53995436fe4ba7bae332242ef0baeaf871ec5252eae07fe97b85af","abstract_canon_sha256":"789decfb8a5755264b209ffe4069a45d887dfbcb6ca06b38fd5c29bc65dba158"},"schema_version":"1.0"},"canonical_sha256":"0c59fe6515f6748e16168750683553ebf0438582d3abf6612e221da168e95faf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:23:03.755117Z","signature_b64":"Qx05g60uRZ1b2Q9euhrov9z1uHztaTnEZWK36TzbWebJhyVKt5Itqi8h3KxuNhu8hPn1gg5iPGemhdRG9kJoBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0c59fe6515f6748e16168750683553ebf0438582d3abf6612e221da168e95faf","last_reissued_at":"2026-05-18T00:23:03.754571Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:23:03.754571Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.06298","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-18T00:23:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xp93F+j4fuHPCWdFUJ/B+z+uw0Z/j720bdUkTjdkXVCiii63st61FvOSZaTuUHy1wQBGH2XF7JSAPo1NQ73KCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T10:35:19.030004Z"},"content_sha256":"9f483cc3a20355240b0b8c3799428ceb2d909e6a66a6d735a58cccee2579e1b7","schema_version":"1.0","event_id":"sha256:9f483cc3a20355240b0b8c3799428ceb2d909e6a66a6d735a58cccee2579e1b7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:BRM74ZIV6Z2I4FQWQ5IGQNKT5P","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Unimodality of the independence polynomials of non-regular caterpillars","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bailey Ethridge, Levente Szabo, Patrick Bahls","submitted_at":"2018-02-17T21:30:06Z","abstract_excerpt":"The independence polynomial $I(G, x)$ of a graph $G$ is the polynomial in variable $x$ in which the coefficient $a_n$ on $x^n$ gives the number of independent subsets $S \\subseteq V(G)$ of vertices of $G$ such that $|S| = n$. $I(G, x)$ is unimodal if there is an index $\\mu$ such that that $a_0 \\leq a_1 \\leq$...$\\leq a_{\\mu-1} \\leq a_{\\mu} \\geq a_{\\mu +1} \\geq$...$\\geq a_{d-1} \\geq a_d$ While the independence polynomials of many families of graphs with highly regular structure are known to be unimodal, little is known about less regularly structured graphs. We analyze the independence polynomia"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.06298","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-18T00:23:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V9huQhHsJsdez8BOM0ztK4/uix+Cc5+1wQIqJBkLIDi5KZaxT62+ZqhZXzZMyTAp6E/Rxiqn17P4rzFb9hgRDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T10:35:19.030351Z"},"content_sha256":"622ecf412042ac46f40b270f679530f51326d2b2335b5e3a36947fc3d7cb4e7b","schema_version":"1.0","event_id":"sha256:622ecf412042ac46f40b270f679530f51326d2b2335b5e3a36947fc3d7cb4e7b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BRM74ZIV6Z2I4FQWQ5IGQNKT5P/bundle.json","state_url":"https://pith.science/pith/BRM74ZIV6Z2I4FQWQ5IGQNKT5P/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BRM74ZIV6Z2I4FQWQ5IGQNKT5P/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-06-02T10:35:19Z","links":{"resolver":"https://pith.science/pith/BRM74ZIV6Z2I4FQWQ5IGQNKT5P","bundle":"https://pith.science/pith/BRM74ZIV6Z2I4FQWQ5IGQNKT5P/bundle.json","state":"https://pith.science/pith/BRM74ZIV6Z2I4FQWQ5IGQNKT5P/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BRM74ZIV6Z2I4FQWQ5IGQNKT5P/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:BRM74ZIV6Z2I4FQWQ5IGQNKT5P","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":"789decfb8a5755264b209ffe4069a45d887dfbcb6ca06b38fd5c29bc65dba158","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-02-17T21:30:06Z","title_canon_sha256":"95da9917ed53995436fe4ba7bae332242ef0baeaf871ec5252eae07fe97b85af"},"schema_version":"1.0","source":{"id":"1802.06298","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.06298","created_at":"2026-05-18T00:23:03Z"},{"alias_kind":"arxiv_version","alias_value":"1802.06298v1","created_at":"2026-05-18T00:23:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.06298","created_at":"2026-05-18T00:23:03Z"},{"alias_kind":"pith_short_12","alias_value":"BRM74ZIV6Z2I","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"BRM74ZIV6Z2I4FQW","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"BRM74ZIV","created_at":"2026-05-18T12:32:16Z"}],"graph_snapshots":[{"event_id":"sha256:622ecf412042ac46f40b270f679530f51326d2b2335b5e3a36947fc3d7cb4e7b","target":"graph","created_at":"2026-05-18T00:23:03Z","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":"The independence polynomial $I(G, x)$ of a graph $G$ is the polynomial in variable $x$ in which the coefficient $a_n$ on $x^n$ gives the number of independent subsets $S \\subseteq V(G)$ of vertices of $G$ such that $|S| = n$. $I(G, x)$ is unimodal if there is an index $\\mu$ such that that $a_0 \\leq a_1 \\leq$...$\\leq a_{\\mu-1} \\leq a_{\\mu} \\geq a_{\\mu +1} \\geq$...$\\geq a_{d-1} \\geq a_d$ While the independence polynomials of many families of graphs with highly regular structure are known to be unimodal, little is known about less regularly structured graphs. We analyze the independence polynomia","authors_text":"Bailey Ethridge, Levente Szabo, Patrick Bahls","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-02-17T21:30:06Z","title":"Unimodality of the independence polynomials of non-regular caterpillars"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.06298","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:9f483cc3a20355240b0b8c3799428ceb2d909e6a66a6d735a58cccee2579e1b7","target":"record","created_at":"2026-05-18T00:23:03Z","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":"789decfb8a5755264b209ffe4069a45d887dfbcb6ca06b38fd5c29bc65dba158","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-02-17T21:30:06Z","title_canon_sha256":"95da9917ed53995436fe4ba7bae332242ef0baeaf871ec5252eae07fe97b85af"},"schema_version":"1.0","source":{"id":"1802.06298","kind":"arxiv","version":1}},"canonical_sha256":"0c59fe6515f6748e16168750683553ebf0438582d3abf6612e221da168e95faf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0c59fe6515f6748e16168750683553ebf0438582d3abf6612e221da168e95faf","first_computed_at":"2026-05-18T00:23:03.754571Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:23:03.754571Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Qx05g60uRZ1b2Q9euhrov9z1uHztaTnEZWK36TzbWebJhyVKt5Itqi8h3KxuNhu8hPn1gg5iPGemhdRG9kJoBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:23:03.755117Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.06298","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9f483cc3a20355240b0b8c3799428ceb2d909e6a66a6d735a58cccee2579e1b7","sha256:622ecf412042ac46f40b270f679530f51326d2b2335b5e3a36947fc3d7cb4e7b"],"state_sha256":"272669241d0ca8fa8e713dfc8b150cc53da04c36cda7f46e94f565150a4bed40"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"N7nRIoocz9leJ+yjwSL1lrQk8lkmIgbBKVKnSdG+mL5oMzLvdZfk8zsovktmpdN/FGb9Av5V0MQ9bF8JAn+LCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T10:35:19.032210Z","bundle_sha256":"0d01e328b3435512098cf5e450d103abf2907e23f4263b5147dc07aca71769ee"}}